Termination w.r.t. Q proof of TRS/TRCSREx2_Luc02a

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)))
sqr(0) → 0
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
add(0, X) → X
add(s(X), Y) → s(add(X, Y))
first(0, X) → nil
first(s(X), cons(Y)) → cons(Y)

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)))
sqr(0) → 0
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
add(0, X) → X
add(s(X), Y) → s(add(X, Y))
first(0, X) → nil
first(s(X), cons(Y)) → cons(Y)

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:

terms₁ > [cons₁, first_2] > [0, dbl₁, nil] > s₁
terms₁ > recip₁ > s₁
terms₁ > sqr₁ > [0, dbl₁, nil] > s₁
terms₁ > sqr₁ > add₂ > s₁

Status:

dbl₁: [1]
first₂: multiset
terms₁: multiset
recip₁: multiset
sqr₁: multiset
add₂: multiset
0: multiset
s₁: multiset
cons₁: [1]
nil: multiset